Applications of the Region Growing Euclidean Distance Transform: Anisotropy and Skeletons
نویسندگان
چکیده
A new region growing algorithm has recently been proposed for computing Euclidean Distance Maps in a time comparable to widely used chamfer DT. In this paper we show how this algorithm can be extended to more complex tasks such as the computation of distance maps on an-isotropic grids and the generation of a new type of Euclidean skeletons.
منابع مشابه
Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform
A general algorithm for computing Euclidean skeletons of 3D data sets in linear time is presented. These skeletons are defined in terms of a new concept, called the integer medial axis (IMA) transform. The algorithm is based upon the computation of 3D feature transforms, using a modification of an algorithm for Euclidean distance transforms. The skeletonization algorithm has a time complexity w...
متن کاملA Micropower Current-Mode Euclidean Distance Calculator for Pattern Recognition
In this paper a new synthesis for circuit design of Euclidean distance calculation is presented. The circuit is implemented based on a simple two-quadrant squarer/divider block. The circuit that employs floating gate MOS (FG-MOS) transistors operating in weak inversion region, features low circuit complexity, low power (<20uW), low supply voltage (0.5V), two quadrant input current, wide dyn...
متن کاملمدلسازی صفحهای محیطهای داخلی با استفاده از تصاویر RGB-D
In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...
متن کاملContent Based Image Retrieval using Contourlet Transform
Content Based Image Retrieval (CBIR) system using Contourlet Transform (CT) based features with high retrieval rate and less computational complexity is proposed in this paper. Unique properties of CT like directionality and anisotropy made it a powerful tool for feature extraction of images in the database. Improved results in terms of computational complexity and retrieval efficiency are obse...
متن کاملHierarchic Voronoi skeletons
Robust and time-efficient skeletonization of a (planar) shape, which is connectivity preserving and based on Euclidean metrics, can be achieved by first regularizing the Voronoi diagram (VD) of a shape’s boundary points, i.e., by removal of noise-sensitive parts of the tessellation and then by establishing a hierarchic organization of skeleton constituents . Each component of the VD is attribut...
متن کامل